Computationally Efficient Gaussian Process
نویسنده
چکیده
Most existing GP regression algorithms assume a single generative model, leading to poor performance when data are nonstationary, i.e. generated from multiple switching processes. Existing methods for GP regression over non-stationary data include clustering and changepoint detection algorithms. However, these methods require significant computation, do not come with provable guarantees on correctness and speed, and most algorithms only work in batch settings. This thesis presents an efficient online GP framework, GP-NBC, that leverages the generalized likelihood ratio test to detect changepoints and learn multiple Gaussian Process models from streaming data. Furthermore, GP-NBC can quickly recognize and reuse previously seen models. The algorithm is shown to be theoretically sample efficient in terms of limiting mistaken predictions. Our empirical results on two real-world datasets and one synthetic dataset show GP-NBC outperforms state of the art methods for nonstationary regression in terms of regression error and computational efficiency. The second part of the thesis introduces a Reinforcement Learning (RL) algorithm, UCRL-GP-CPD, for multi-task Reinforcement Learning when the reward function is nonstationary. First, a novel algorithm UCRL-GP is introduced for stationary reward functions. Then, UCRL-GP is combined with GP-NBC to create UCRL-GP-CPD, which is an algorithm for nonstationary reward functions. Unlike previous work in the literature, UCRL-GP-CPD does not make distributional assumptions about task generation, does not assume changepoint times are known, and does not assume that all tasks have been experienced a priori in a training phase. It is proven that UCRL-GP-CPD is sample efficient in the stationary case, will detect changepoints in the environment with high probability, and is theoretically guaranteed to prevent negative transfer. UCRL-GP-CPD is demonstrated empirically on a variety of simulated and real domains. Thesis Supervisor: Jonathan P. How Title: Richard C. Maclaurin Professor of Aeronautics and Astronautics
منابع مشابه
Exploiting Variance Reduction Potential in Local Gaussian Process Search
Gaussian process models are commonly used as emulators for computer experiments. However, developing a Gaussian process emulator can be computationally prohibitive when the number of experimental samples is even moderately large. Local Gaussian process approximation (Gramacy and Apley, 2015) was proposed as an accurate and computationally feasible emulation alternative. However, constructing lo...
متن کاملPotentially Predictive Variance Reducing Subsample Locations in Local Gaussian Process Regression
Gaussian process models are commonly used as emulators for computer experiments. However, developing a Gaussian process emulator can be computationally prohibitive when the number of experimental samples is even moderately large. Local Gaussian process approximation (Gramacy and Apley, 2015) has been proposed as an accurate and computationally feasible emulation technique. Constructing sub-desi...
متن کاملComputationally Efficient Bayesian Learning of Gaussian Process State Space Models
Gaussian processes allow for flexible specification of prior assumptions of unknown dynamics in state space models. We present a procedure for efficient Bayesian learning in Gaussian process state space models, where the representation is formed by projecting the problem onto a set of approximate eigenfunctions derived from the prior covariance structure. Learning under this family of models ca...
متن کاملThe Echo State Gaussian Process
Echo state networks (ESNs) constitute a novel approach to recurrent neural network (RNN) training, with an RNN (the reservoir) being generated randomly, and only a readout being trained using a simple, computationally efficient algorithm. ESNs have greatly facilitated the practical application of RNNs, outperforming classical approaches on a number of benchmark tasks. In this paper, we introduc...
متن کاملComputationally Efficient Maximum Likelihood Sequence Estimation and Activity Detection for M -PSK Signals in Unknown Flat Fading Channels
In this paper, we develop a computationally efficient algorithm for the Maximum Likelihood (ML) sequences estimation (MLSE) of an M-ary Phase Shift keying (M–PSK) signal transmitted over a frequency non-selective slow fading channel with an unknown complex amplitude and an unknown variance additive white Gaussian noise. The proposed algorithm also provides the ML estimates of the complex amplit...
متن کاملBias Minimization in Gaussian Process Surrogatemodeling for Uncertainty Quantification
Uncertainty quantification analyses often employ surrogate models as computationally efficient approximations of computer codes simulating the physical phenomena. The accuracy and economy in the construction of surrogate models depends on the quality and quantity of data collected from the computationally expensive system models. Computationally efficient methods for accurate surrogate model tr...
متن کامل